Label Propagation Based on Bipartite Graph

نویسندگان

چکیده

Label propagation (LP) is a popular graph-based semi-supervised learning framework. Its effectiveness limited by the distribution of prior labels. If there are no objects with labels in parts classes, label has very poor performance. To address this issue, we propose based on bipartite graph (LPBBG) algorithm. This approach try to learn as exemplar constraints that reflect relations between and exemplars guide process instead traditional propagation. In paper, provide method for producing high-quality from two channels represent known classes (where some have labels) missing all labels). Given generated exemplars, can be learned using relationships evaluate classes. Our experimental results show LPBBG algorithm outperforms existing LP methods overcoming problem

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Engine Click Spam Detection Based on Bipartite Graph Propagation

Using search engines to retrieve information has become an important part of people’s daily lives. For most search engines, click information is an important factor in document ranking. As a result, some websites cheat to obtain a higher rank by fraudulently increasing clicks to their pages, which is referred to as “Click Spam”. Based on an analysis of the features of fraudulent clicks, a novel...

متن کامل

A Metric Learning Approach for Graph-based Label Propagation

The efficiency of graph-based semi-supervised algorithms depends on the graph of instances on which they are applied. The instances are often in a vectorial form before a graph linking them is built. The construction of the graph relies on a metric over the vectorial space that help define the weight of the connection between entities. The classic choice for this metric is usually a distance me...

متن کامل

Based on Bipartite Graph Label Gene Extraction Algorithm of Network Structure

Firstly we make a pretreatment to the original gene data, and analyze the information of sample gene graph by two steps. First step is removing the unrelated genes; Second step is use an extraction algorithm of label gene based on bipartite network structure to handle the candidate gene, and get gene interactive relationship network. Finally extracts some label gene form the gene interactive re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neural Processing Letters

سال: 2023

ISSN: ['1573-773X', '1370-4621']

DOI: https://doi.org/10.1007/s11063-023-11282-5